Iterative Dynamic Load Balancing in Multicomputers

نویسنده

  • Cheng-Zhong XU
چکیده

Dynamic load balancing in multicomputers can improve the utilization of processors and the eeciency of parallel computations through migrating workload across processors at runtime. We present a survey and critique of dynamic load balancing strategies that are iterative: workload migration is carried out through transferring processes across nearest neighbor processors. Iterative strategies have become prominent in recent years because of the increasing popularity of point-to-point interconnection networks for multicomputers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of a Parallel Iterative Linear System Solver with Dynamic Load Balancing

This report describes the design and implementation of the parallel iterative linear system solver PAISS (Parallel Adaptive Iterative linear System Solver) for distributed memory multicomputers and workstation clusters. It is capable to apply a heterogeneous data distribution and dynamic load balancing within an iterative solver routine at matrix level. Sparse and dense matrices, as well as vec...

متن کامل

Synchronous Load Balancing in Hypercube Multicomputers with Faulty Nodes

This paper presents a new dynamic load-balancing algorithm for hypercube multicomputers with faulty nodes. The emphasis in our method is on obtaining global load information and performing task migration using ``short paths'' in a synchronous manner so that a minimal amount of communication overhead is required. To accomplish this, we present an algorithm for constructing a new logical topology...

متن کامل

An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers

This paper presents an improved direct dimension exchange method (DDE) for synchronous load balancing for k-ary n-cube multicom-puters. The new method is based on the improved DEM for hypercube. The original DEM when extended to the k-ary n-cube requires many iterations in exchanging loads between neighboring nodes to converge to a balanced state. The original DDE does not requires iteratively ...

متن کامل

Implementation of a Region Growing Algorithm on Multicomputers: Analysis of the Work Load Balance

This paper discusses and evaluates different parallel implementations of a Region Growing algorithm based on the Split-and-Merge approach proposed by Horowitz and Pavlidis [1]. Region growing is a general technique for image segmentation. The basic scheme consists of joining adjacent pixels to form regions; adjacent regions are then merged to obtain larger regions. The solution has been conceiv...

متن کامل

Static versus dynamic heterogeneous parallel schemes to solve the symmetric tridiagonal eigenvalue problem

Computation of the eigenvalues of a symmetric tridiagonal matrix is a problem of great relevance. Many linear algebra libraries provide subroutines for solving it. But none of them is oriented to be executed in heterogeneous distributed memory multicomputers. In this work we focus on this kind of platforms. Two different load balancing schemes are presented and implemented. The experimental res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994